منابع مشابه
Subtree filament graphs are subtree overlap graphs
We show that the class of intersection graphs of subtree filaments in a tree is identical to the class of overlap graphs of subtrees in a tree.
متن کاملFast subtree kernels on graphs
In this article, we propose fast subtree kernels on graphs. On graphs with n nodes and m edges and maximum degree d, these kernels comparing subtrees of height h can be computed in O(mh), whereas the classic subtree kernel by Ramon & Gärtner scales as O(n4h). Key to this efficiency is the observation that the Weisfeiler-Lehman test of isomorphism from graph theory elegantly computes a subtree k...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملOptimization Problems in Multiple Subtree Graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph class generalizes both the class of chordal graphs and the class of t-interval graphs, a generalization of interval graphs that has recently been studied from a combinatorial optimization point of view. We present approx...
متن کاملUniversal graphs with a forbidden subtree
The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated in [13], followed by [12]. If C is a finite connected graph, then a graph G is C-free if it contains no subgraph isomorphic to C. A countable C-free graph G is weakly universal if every countable C-free graph is isomorphic to a subgraph of G, and strongly universal if every such graph is isomorph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90165-k